Strong and Nv-sequentiality of Constructor Systems (extended Abstract) ?
نویسنده
چکیده
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used as an abstract model of some programming languages. While the availability of normalizing strategies is always desirable for achieving a good computational behavior of programs, when dealing with lazy languages innnitary normalizing strategies should be considered instead since ((nite approximations of) innnite data structures can be returned as the result of computations. Recently , it has been shown that only NV-sequential TRSs (hence strongly sequential TRSs, a subclass of them) provide an adequate basis for the eeective deenition of normalizing and innnitary normalizing strategies. In this paper, we show that strongly sequential and NV-sequential CSs coincide. Since the implementation of NV-sequential TRSs has been studied much less than strongly sequential TRSs, the fact that they coincide for CSs suggests that, in programming languages, it is a good option to implement NV-sequentiality as strong sequentiality.
منابع مشابه
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used as an abstract model of some programming languages. While normalizing strategies are always desirable for achieving a good computational behavior of programs, when dealing with lazy languages infinitary normalizing strategies should be considered instead since (finite approximations of) infini...
متن کاملEfficient Simulation of Forward-Branching Systems with Constructor Systems
Strongly sequential constructor systems admit a very eecient algorithm to compute normal forms. Thatte found a transformation that allows us to simulate any orthogonal system with a constructor system. Unfortunately, this transformation does not generally preserve strong sequentiality. On the other hand, the class of forward-branching systems contains the class of strongly sequential constructo...
متن کاملConstructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof
In 8], Thatte demonstrated the possibility of simulating an orthogonal TRS with a left-linear constructor system obtained from the original system via a simple transformation. The class of strongly sequential systems (SS) was deened in 3]. In 2], we have deened the class of constructor equivalent systems (CE) for which Thatte's transformation preserves strong sequentiality; in that same article...
متن کاملSequentiality, Second Order Monadic Logic and Tree Automata
Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction sequence of t to a normal form, this redex will be contracted. Roughly, R is sequential if there is an optimal reduction strategy in which only needed redexes are contracted. More generally, G. Huet and J.-J. L evy deene in 9] the sequentiality of a predicate P on partially evaluated terms. We show ...
متن کاملSequentiality, Monadic Second-Order Logic and Tree Automata
Given a term rewriting system R and a normalizable term t, a redex is needed if in any reduction sequence of t to a normal form, this redex will be contracted. Roughly, R is sequential if there is an optimal reduction strategy in which only needed redexes are contracted. More generally, G. Huet and J.-J. L evy de ne in [9] the sequentiality of a predicate P on partially evaluated terms. We show...
متن کامل